Congruence Distributivity Implies Bounded Width
نویسندگان
چکیده
We show that a constraint language with compatible Jónnson terms (i.e. associated with an algebra generating a congruence distributive variety) defines a Constraint Satisfaction Problem solvable by the local consistency checking algorithm.
منابع مشابه
ar X iv : 0 70 5 . 22 29 v 1 [ cs . C C ] 1 5 M ay 2 00 7 On tractability and congruence distributivity ∗
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An important class of algebras are those that generate congruence distributive varieties and included among this class are lattices, and more generally, those algebras that have near-unanimity term operations. An algebra will gen...
متن کاملFinitely Related Algebras in Congruence Distributive Varieties Have Near Unanimity Terms
We show that every finite, finitely related algebra in a congruence distributive variety has a near unanimity term operation. As a consequence we solve the near unanimity problem for relational structures: it is decidable whether a given finite set of relations on a finite set admits a compatible near unanimity operation. This consequence also implies that it is decidable whether a given finite...
متن کاملFew subpowers, congruence distributivity and near-unanimity terms
We prove that for any variety V, the existence of an edge-term (defined in [1]) and Jónsson terms is equivalent to the existence of a near-unanimity term. We also characterize the idempotent Maltsev conditions which are defined by a system of linear absorption equations and which imply congruence distributivity.
متن کاملOn the Complexity of Some Maltsev Conditions
This paper studies the complexity of determining if a finite algebra generates a variety that satisfies various Maltsev conditions, such as congruence distributivity or modularity. For idempotent algebras we show that there are polynomial time algorithms to test for these conditions but that in general these problems are EXPTIME complete. In addition, we provide sharp bounds in terms of the siz...
متن کاملFunctions on Distributive Lattices with the Congruence Substitution Property: Some Problems of Grätzer from 1964
Let L be a bounded distributive lattice. For k 1, let Sk (L) be the lattice of k-ary functions on L with the congruence substitution property (Boolean functions); let S(L) be the lattice of all Boolean functions. The lattices that can arise as Sk (L) or S(L) for some bounded distributive lattice L are characterized in terms of their Priestley spaces of prime ideals. For bounded distributive lat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 39 شماره
صفحات -
تاریخ انتشار 2009